#include <iostream>
#include <vector>
using namespace std;

class Solution
{
public:
    static int searchInsert(vector<int>& nums, int target)
    {
        int left = 0, right = nums.size()-1;

        while(left < right)
        {
            int mid = left+(right-left)/2;
            if(nums[mid] < target)      left = mid+1;
            else    right = mid;
        }
        if(nums[left] < target)
            return left+1;
        else
            return left;
    }
};
